Evaluating Pedometer Algorithms on Semi-Regular and Unstructured Gaits

A note on semi-regular locales

Semi-regular locales are extensions of the classical semiregular spaces. We investigate the conditions such that semi-regularization is a functor. We also investigate the conditions such that semi-regularization is a reflection or coreflection.

Semi-Unstructured Grids

Regular gaits and optimal velocities for motor proteins.

It has been observed in numerical experiments that adding a cargo to a motor protein can regularize its gait. Here we explain these results via asymptotic analysis on a general stochastic motor protein model. This analysis permits a computation of various observables (e.g., the mean velocity) of the motor protein and shows that the presence of the cargo also makes the velocity of the motor nonm...

Good strongly regular relations on weak $Gamma$-(semi)hypergroups

In this paper first we introduce the notion of weak $Gamma$-(semi)hypergroups, next some classes of equivalence relations which are called good regular and strongly good regular relations are defined.  Then we investigate some properties of this kind of relations on weak $Gamma$-(semi)hypergroups.

Path Algorithms on Regular Graphs

We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infinite graphs generated by deterministic graph grammars.